A Polynomial Time Solution to the Clique Problem
نویسندگان
چکیده
The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.
منابع مشابه
A Machine Model for the Complexity of NP-Approximation Problems
Many introductions to the theory of NP-completeness make some mention of approximating NP-complete problems. The usual story line says that even though solving an NP-complete problem exactly may be intractable, it is sometimes possible to find an approximate solution in polynomial time. The intuitive assumption is that finding an approximate solution should be easier than finding the exact solu...
متن کاملReduction of Maximum Flow Network Interdiction Problem from The Clique Problem
Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.
متن کاملCardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem
Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reduction from clique problem. In the present work,an effort is being made to solve this particular case of CMFNIP in polynomial time. Direct implication of this solution is that the clique problem gets solved in polynomial ...
متن کاملA Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami
In this work, we critique two papers, “A Polynomial-Time Solution to the Clique Problem” by Tamta, Pande, and Dhami [3], and “A Polynomial-Time Algorithm For Solving Clique Problems” by LaPlante [1]. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully established that P = NP.
متن کاملComplexity Analysis of Clique Problem
MAXIMUM CLIQUE PROBLEM the most relevant problem in Graph theory, known for years still do not have its polynomial time solution. Many algorithms have been proposed, still the problem lie the same i.e. to find the Clique in the polynomial time. The Clique problem is to figure out the sub graph with the maximum cardinality. Maximum clique in a random graph is NP-Hard problem, actuated by many pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.1178 شماره
صفحات -
تاریخ انتشار 2014